Coterie Availability in Sites
نویسندگان
چکیده
In this paper, we explore new failure models for multi-site systems, which are systems characterized by a collection of sites spread across a wide area network, each site formed by a set of computing nodes running processes. In particular, we introduce two failure models that allow sites to fail, and we use them to derive coteries. We argue that these coteries have better availability than quorums formed by a majority of processes, which are known for having best availability when process failures are independent and identically distributed. To motivate introducing site failures explicitly into a failure model, we present availability data from a production multi-site system, showing that sites are frequently unavailable. We then discuss the implementability of our abstract models, showing possibilities for obtaining these models in practice. Finally, we present evaluation results from running an implementation of the Paxos algorithm on PlanetLab using different quorum constructions. The results show that our constructions have substantially better availability and response time compared to
منابع مشابه
The Availability of Complemental k-Coteries
k-Coterie is a graceful concept to solve the distributed k-mutual exclusion problem. The k-mutual exclusion algorithm adopting k-coteries could provide the fault-tolerant capability. The complementalness and the availability are two important metrics to measure the fault-tolerant capability of a k-coterie. Since those two metrics are defined under two different failure assumptions, for a given ...
متن کاملTransformations on Regular Nondominated Coteries and Their Applications
A coterie under an underlying set U is a family of subsets of U such that every pair of subsets has at least one element in common, but neither is a subset of the other. A coterie C under U is said to be nondominated (ND) if there is no other coterie D under U such that, for every Q ∈ C, there exists Q ∈ D satisfying Q ⊆ Q. We introduce the operation σ which transforms a ND coterie to another N...
متن کاملComments on "Availability of k-Coterie"
Kakugawa et aL proposed the k-majority coterie for the distributed k-mutual exclusion problem (k-mutex). It was claimed that the k-majority coterie is a k-coterie, which is a general solution for k-mutex. In this comment, we show that the k-majority coterie is not necessary a k-coterie.
متن کاملA Coterie Join Operation and Tree Structured k-Coteries
ÐThe coterie join operation proposed by Neilsen and Mizuno produces, from a k-coterie and a coterie, a new k-coterie. For the coterie join operation, this paper first shows 1) a necessary and sufficient condition to produce a nondominated k-coterie (more accurately, a nondominated k-semicoterie satisfying Nonintersection Property) and 2) a sufficient condition to produce a k-coterie with higher...
متن کاملImproving the Availability of Mutual Exclusion Systems on Incomplete Networks
ÐWe model a distributed system by a graph G V ;E, where V represents the set of processes and E the set of bidirectional communication links between two processes. G may not be complete. A popular (distributed) mutual exclusion algorithm on G uses a coterie C 2 , which is a nonempty set of nonempty subsets of V (called quorums) such that, for any two quorums P;Q 2 C, 1) P \Q 6 ; and 2) P...
متن کاملA Study on the Distributed k-Mutual Exclusion Problem
The distributed k-mutual exclusion problem is the problem of guaranteeing that at most k processes can enter a critical section at a time in a distributed system. The distributed 1-mutual exclusion problem is one of fundamental distributed problems in distributed systems and many algorithms for solving the problem have been proposed. In this paper, we introduce the k-coterie as an extension of ...
متن کامل